Improving Relaxed Planning Graph Heuristics for Metric Optimization
نویسندگان
چکیده
Currently a standard technique to compute the heuristic in heuristic planning is to expand a planning graph on the relaxed problem. This paper presents a new approach to expand the planning graph, such that heuristic estimations are more accurate when an optimization metric criteria is given. Additionally, a new kind of Hill-Climbing search that combines two heuristics is proposed to deal with metrics. Results show that the quality of the resulting plans with respect to the metric optimization criteria is improved.
منابع مشابه
Handling Numeric Criteria in Relaxed Planning Graphs
Nowadays, one of the main techniques used in heuristic planning is the generation of a relaxed planning graph, based on a Graphplan-like expansion. Planners like FF or MIPS use this type of graphs in order to compute distance-based heuristics during the planning process. This paper presents a new approach to extend the functionality of these graphs in order to manage numeric optimization criter...
متن کاملA Hybrid Relaxed Planning Graph'LP Heuristic for Numeric Planning Domains
Effective search control for numeric planning domains, in which appropriate numeric resource usage is critical to solving the problem, remains an open challenge in domainindependent planning. Most real-world problems rely on metric resources such as energy, money, fuel or materials. Despite the importance of numbers, few heuristics have been proposed to guide search in such domains. Hoffmann’s ...
متن کاملSapa: A Domain-Independent Heuristic Metric Temporal Planner
Many real world planning problems require goals with deadlines and durative actions that consume resources. In this paper, we present Sapa, a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. The main innovation of Sapa is the set of distance based heuristics it employs to control its search. We consider both...
متن کاملBelief Space Reachability Heuristics for Conformant and Contingent Planning
Although reachability heuristics have been shown to be useful in conformant an contingent planning, the cost of heuristic computation is still an issue. We present several improvements of our previous work on planning graph heuristics for planning in belief space. One, we generalize our approach, based on using multiple planning graphs, to symbolically represent many planning graphs in a struct...
متن کاملAdmissible Heuristics for Automated Planning
The problem of domain-independent automated planning has been a topic of research in Artificial Intelligence since the very beginnings of the field. Due to the desire not to rely on vast quantities of problem specific knowledge, the most widely adopted approach to automated planning is search. The topic of this thesis is the development of methods for achieving effective search control for doma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006